首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   7699篇
  免费   771篇
  国内免费   666篇
化学   815篇
晶体学   16篇
力学   885篇
综合类   191篇
数学   5784篇
物理学   1445篇
  2024年   3篇
  2023年   80篇
  2022年   164篇
  2021年   213篇
  2020年   225篇
  2019年   206篇
  2018年   187篇
  2017年   270篇
  2016年   294篇
  2015年   195篇
  2014年   371篇
  2013年   550篇
  2012年   385篇
  2011年   464篇
  2010年   409篇
  2009年   587篇
  2008年   521篇
  2007年   508篇
  2006年   464篇
  2005年   435篇
  2004年   327篇
  2003年   331篇
  2002年   282篇
  2001年   205篇
  2000年   214篇
  1999年   182篇
  1998年   209篇
  1997年   136篇
  1996年   124篇
  1995年   74篇
  1994年   65篇
  1993年   52篇
  1992年   66篇
  1991年   43篇
  1990年   29篇
  1989年   32篇
  1988年   30篇
  1987年   20篇
  1986年   21篇
  1985年   34篇
  1984年   28篇
  1983年   14篇
  1982年   17篇
  1981年   16篇
  1980年   15篇
  1979年   11篇
  1978年   11篇
  1975年   2篇
  1974年   3篇
  1972年   3篇
排序方式: 共有9136条查询结果,搜索用时 15 毫秒
31.
For 1 ≤ dk, let Kk/d be the graph with vertices 0, 1, …, k ? 1, in which ij if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χc(H) = ωc(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, NG[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, NG[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P5 (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph Kk/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005  相似文献   
32.
凸合成模糊对策的模糊稳定集   总被引:3,自引:1,他引:2  
本建立了凸合成模糊对策的模型,并得到了凸合成模糊对策的模糊稳定集,可由子对策的模糊稳定集表达出来。从而解决了凸合成模糊对策的解的结构问题。  相似文献   
33.
This paper presents an evaluation of the capability of turbulence models available in the commercial CFD code FLUENT 6.0 for their application to hydrofoil turbulent boundary layer separation flow at high Reynolds numbers. Four widely applied two‐equation RANS turbulence models were assessed through comparison with experimental data at Reynolds numbers of 8.284×106 and 1.657×107. They were the standard k–εmodel, the realizable k–εmodel, the standard k–ωmodel and the shear‐stress‐transport (SST) k–ωmodel. It has found that the realizable k–εturbulence model used with enhanced wall functions and near‐wall modelling techniques, consistently provides superior performance in predicting the flow characteristics around the hydrofoil. Copyright © 2004 John Wiley & Sons, Ltd.  相似文献   
34.
A method for computing low Mach number flows using high‐resolution interpolation and difference formulas, within the framework of the Marker and Cell (MAC) scheme, is presented. This increases the range of wavenumbers that are properly resolved on a given grid so that a sufficiently accurate solution can be obtained without extensive grid refinement. Results using this scheme are presented for three problems. The first is the two‐dimensional Taylor–Green flow which has a closed form solution. The second is the evolution of perturbations to constant‐density, plane channel flow for which linear stability solutions are known. The third is the oscillatory instability of a variable density plane jet. In this case, unless the sharp density gradients are resolved, the calculations would breakdown. Under‐resolved calculations gave solutions containing vortices which grew in place rather than being convected out. With the present scheme, regular oscillations of this instability were obtained and vortices were convected out regularly. Stable computations were possible over a wider range of sensitive parameters such as density ratio and co‐flow velocity ratio. Copyright © 2004 John Wiley Sons, Ltd.  相似文献   
35.
We study digit expansions with arbitrary integer digits in base q (q integer) and the Fibonacci base such that the sum of the absolute values of the digits is minimal. For the Fibonacci case, we describe a unique minimal expansion and give a greedy algorithm to compute it. Additionally, transducers to calculate minimal expansions from other expansions are given. For the case of even integer bases q, similar results are given which complement those given in [6].  相似文献   
36.
For the Boussinesq approximation of the equations of coupled heat and fluid flow in a porous medium we show that the corresponding system of partial differential equations possesses a global attractor. We give lower and upper bounds of the Hausdorff dimension of the attractor depending on a physical parameter of the system, namely the Rayleigh number of the flow. Numerical experiments confirm the theoretical findings and raise new questions on the structure of the solutions of the system. Copyright © 2004 John Wiley & Sons, Ltd.  相似文献   
37.
模糊全区间序结构   总被引:2,自引:0,他引:2  
王绪柱  宋雪丽 《数学杂志》2005,25(3):320-326
本文试图对模糊偏好结构及模糊全区间序结构的定义进行探讨,并讨论它们的性质.以Fodor等提出的公理为基础,给出了模糊偏好结构的定义,同时对一类重要的模糊偏好结构-模糊全区间序结构的性质进行了讨论,得出了模糊全区间序结构的一些充要条件.  相似文献   
38.
复数域上线性系统x=A(t)x,当A(t)=(aij(t))n×n具有(n,N,r) 差异性质且rn时,解的特征数j有估计λj-limt→∞1t∫tt0Reaj(τ)dτn-1r+1-nlimt→∞1t∫tt0A(τ)dτ,j=1,2,…,n,其中A(t)=max{|aij(t)|:i,j=1,2,…,n,i≠j.}  相似文献   
39.
The equivalent geometrical configurations of linear ordered orthogonal arrays are determined when their strengths are 3 and 4. Existence of such geometrical configurations is investigated. They are also useful in the study of (T, M, S)-nets.  相似文献   
40.
激光调Q CAI   总被引:4,自引:3,他引:1  
从激光调Q速率方程出发,分析推导了激光调Q过程中,腔内光子数与工作物质内反转粒子数间的关系.再根据激光调Q的过程中,对腔Q值控制方式不同,将激光调Q技术分为:转镜调Q、声光调Q、电光调Q、饱和吸收调Q和脉冲透射式调Q.用C语言进行了激光调Q CAI软件的开发研制,获得了将文学、图形、动画和计算融为一体的,直观而生动地将调Q的理论和过程再现于屏幕的CAI课件.介绍了课件的内容、结构及其特点.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号